
<!DOCTYPE html>
<html>

	<head>
	<title>CAIJL's Blog</title>
	<meta charset="utf-8"/>
	<link rel="stylesheet" href="/font-awesome-4.7.0/css/font-awesome.min.css">

	<link rel="stylesheet" href="/bootstrap-3.3.7/css/bootstrap.min.css">
	<script src="/jquery-2.1.1/jquery.min.js"></script>
	<script src="/bootstrap-3.3.7/js/bootstrap.min.js"></script>

	<link rel="stylesheet" href="/css/bootstrap-slider.min.css">
	<script src="/js/bootstrap-slider.min.js"></script>
	
	<link rel="stylesheet" href="/css/main.css">
	<script src="/js/main.js"></script>
	
	<link rel="stylesheet" href="/css/cursor.css">
	<script src="/js/cursor.js"></script>
	
	
	<link rel="stylesheet" href="/css/code.css">
	<!--link rel="stylesheet" href="/css/markdown.css"-->
	
	<link rel="stylesheet" href="/css/head.css">

	<script src="/js/window.js"></script>
	<script src='//unpkg.com/valine/dist/Valine.min.js'></script>
	</head>
<body>

	<link rel="stylesheet" href="/katex/katex.min.css" crossorigin="anonymous">
	<script src="/katex/katex.min.js" crossorigin="anonymous"></script>
	<script src="/katex/contrib/mathtex-script-type.min.js" defer></script>
	<script defer src="/katex/contrib/auto-render.min.js"crossorigin="anonymous"
	    onload="renderMathInElement(document.body);"></script>
	<script>document.addEventListener("DOMContentLoaded", function() {renderMathInElement(document.body,{"delimiters":[{left: "$", right: "$", display: false}]});});</script>
	<nav class="navbar navbar-default header card" role="navigation" style="width: 100%;">
	<div class="container-fluid"> 
	<div class="navbar-header">
		<button type="button" class="navbar-toggle" data-toggle="collapse"
				data-target="#example-navbar-collapse">
			<span class="icon-bar"></span>
			<span class="icon-bar"></span>
			<span class="icon-bar"></span>
		</button>
		<a class="navbar-brand" href="/"><span><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi mathvariant="bold">C</mi><mi mathvariant="bold">A</mi><mi mathvariant="bold">I</mi><mi mathvariant="bold">J</mi><msup><mi mathvariant="bold">L</mi><mo mathvariant="bold" lspace="0em" rspace="0em">′</mo></msup><mi mathvariant="bold">s</mi><mi mathvariant="bold">B</mi><mi mathvariant="bold">L</mi><mi mathvariant="bold">O</mi><mi mathvariant="bold">G</mi></mrow><annotation encoding="application/x-tex">\mathbf{CAIJL'sBLOG}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height: 0.751892em; vertical-align: 0em;"></span><span class="mord"><span class="mord mathbf">C</span><span class="mord mathbf">A</span><span class="mord mathbf">I</span><span class="mord mathbf">J</span><span class="mord"><span class="mord mathbf">L</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height: 0.751892em;"><span class="" style="top: -3.063em; margin-right: 0.05em;"><span class="pstrut" style="height: 2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathbf mtight">′</span></span></span></span></span></span></span></span></span><span class="mord mathbf">s</span><span class="mord mathbf">B</span><span class="mord mathbf">L</span><span class="mord mathbf">O</span><span class="mord mathbf">G</span></span></span></span></span></span></a>
	</div>
	<div class="collapse navbar-collapse" id="example-navbar-collapse">
		<ul class="nav navbar-nav" style="background-color:#fcfcfc">
			<li><a href="/"><i class="menu-item-icon fa fa-fw fa-home"></i>首页</a></li>
			<li><a href="/archives/"><i class="menu-item-icon fa fa-fw fa-archive"></i>文章</a></li>
			<li><a href="/tags/"><i class="menu-item-icon fa fa-fw fa-tags"></i>标签</a></li>
			<li><a href="/settings/"><i class="menu-item-icon fa fa-fw fa-cogs"></i>设置</a></li>
			<!--li><a href="/about/"><i class="menu-item-icon fa fa-fw fa-user"></i>关于</a></li-->
			<li><a href="/games/"><i class="menu-item-icon fa fa-fw fa-gamepad"></i>其它</a></li>
			

		</ul>
	</div>
	</div>
	</nav>
<div class="container">
	<div style="height: 60px;"></div>
	<div class="row" >
		<div class="col-md-8">
			<div class="panel panel-default card" style="padding: 10px;position: relative;">
                <img src='/img/bg/14.png' style="width:100%"/>
				<span style="position: absolute;left:15px;bottom:15px;width:90%;"><font class="view-text" style="color:#fcfcfc;font-size:25px">题解 CF650D 【Zip-line】</font><br><a href="/tags/2020/" class="tag"><span  style="background-color: rgb(52, 152, 219);">2020</span></a>&nbsp;<a href="/tags/树状数组/" class="tag"><span  style="background-color: rgb(231, 76, 60);">树状数组</span></a>&nbsp;<a href="/tags/题解/" class="tag"><span  style="background-color: rgb(82, 196, 26);">题解</span></a></span>
			</div>
			<div class="panel panel-default card" style="padding: 10px;" id="main">
                <p>考虑如果我修改了一个数字，那么这时候答案是两部分的最大值：</p>
<ul>
<li>
<p>经过这个点的LIS。 </p>
</li>
<li>
<p>不经过这个点的LIS。</p>
</li>
</ul>
<p>我们先考虑做1。</p>
<p>对于经过每个点的，就是前缀比他小的和后缀比它大的加起来，再加上它。</p>
<!--more-->
<p>我们再分成三部分。</p>
<p>对于前缀比它小的，我们从左往右扫描，同时统计相应的答案（用树状数组维护）后缀同理，再加一。当然也可以强行主席树做。</p>
<p>考虑2，不经过这点的LIS。</p>
<p>显然答案要么是原来的len，要么是len-1。</p>
<p>这样我们只需要判断是否每一个LIS都必须经过它。</p>
<p>首先需要判断这个点是否能成为LIS的一部分。</p>
<p>设这个点的位置是i，要满足这个条件必须满足以i结束的最长上升子序列的长度加上以i开始的最长上升子序列的长度是原来的LIS-1。</p>
<p>同时，你要保证它是唯一的。</p>
<p>比如对于<code>1 2 2 3</code>，中间的两个2就不是唯一的。</p>
<p>怎么判断是否是唯一的？就是只有它能够转移到最后面，也就是如果存在（i,j）满足都可能成为LIS的一部分的，如果以i结束的LIS的长度和以j结束的LIS长度相同，那么i和j就可以互相替换。</p>
<p>代码
<div class="highlight"><pre><span></span><code><span class="linenos" data-linenos=" 1 "></span><span class="cp">#include</span><span class="cpf">&lt;bits/stdc++.h&gt;</span><span class="cp"></span>
<span class="linenos" data-linenos=" 2 "></span><span class="k">using</span> <span class="k">namespace</span> <span class="n">std</span><span class="p">;</span>
<span class="linenos" data-linenos=" 3 "></span><span class="cp">#define maxn 400005</span>
<span class="linenos" data-linenos=" 4 "></span><span class="cp">#define IL inline</span>
<span class="linenos" data-linenos=" 5 "></span><span class="cp">#define RG register</span>
<span class="linenos" data-linenos=" 6 "></span><span class="cp">#define rep(i,a,b) for(RG int i=(a);i&lt;(int)(b);++i)</span>
<span class="linenos" data-linenos=" 7 "></span><span class="cp">#define Rep(i,a,b) for(RG int i=(a);i&lt;=(int)(b);++i)</span>
<span class="linenos" data-linenos=" 8 "></span><span class="cp">#define Dep(i,a,b) for(RG int i=(a);i&gt;=(int)(b);--i)</span>
<span class="linenos" data-linenos=" 9 "></span><span class="cp">#define pc putchar</span>
<span class="linenos" data-linenos="10 "></span><span class="cp">#define gc getchar</span>
<span class="linenos" data-linenos="11 "></span><span class="k">using</span> <span class="k">namespace</span> <span class="n">std</span><span class="p">;</span>
<span class="linenos" data-linenos="12 "></span><span class="kr">inline</span> <span class="kt">int</span> <span class="n">read</span><span class="p">(){</span>
<span class="linenos" data-linenos="13 "></span>    <span class="n">RG</span> <span class="kt">int</span> <span class="n">x</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">RG</span> <span class="kt">char</span> <span class="n">f</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">RG</span> <span class="kt">char</span> <span class="n">c</span><span class="o">=</span><span class="n">gc</span><span class="p">();</span>
<span class="linenos" data-linenos="14 "></span>    <span class="k">for</span><span class="p">(;</span><span class="o">!</span><span class="n">isdigit</span><span class="p">(</span><span class="n">c</span><span class="p">);</span><span class="n">c</span><span class="o">=</span><span class="n">gc</span><span class="p">())</span><span class="n">f</span><span class="o">|=</span><span class="p">(</span><span class="n">c</span><span class="o">==</span><span class="sc">&#39;-&#39;</span><span class="p">);</span>
<span class="linenos" data-linenos="15 "></span>    <span class="k">for</span><span class="p">(;</span><span class="n">isdigit</span><span class="p">(</span><span class="n">c</span><span class="p">);</span><span class="n">c</span><span class="o">=</span><span class="n">gc</span><span class="p">())</span><span class="n">x</span><span class="o">=</span><span class="p">(</span><span class="n">x</span><span class="o">&lt;&lt;</span><span class="mi">1</span><span class="p">)</span><span class="o">+</span><span class="p">(</span><span class="n">x</span><span class="o">&lt;&lt;</span><span class="mi">3</span><span class="p">)</span><span class="o">+</span><span class="p">(</span><span class="n">c</span><span class="o">^</span><span class="mi">48</span><span class="p">);</span>
<span class="linenos" data-linenos="16 "></span>    <span class="k">return</span> <span class="n">f</span><span class="o">?-</span><span class="nl">x</span><span class="p">:</span><span class="n">x</span><span class="p">;</span>
<span class="linenos" data-linenos="17 "></span><span class="p">}</span>
<span class="linenos" data-linenos="18 "></span><span class="kt">void</span> <span class="n">write</span><span class="p">(</span><span class="kt">long</span> <span class="kt">long</span> <span class="n">x</span><span class="p">){</span>
<span class="linenos" data-linenos="19 "></span>    <span class="k">if</span><span class="p">(</span><span class="n">x</span><span class="o">&gt;=</span><span class="mi">10</span><span class="p">)</span><span class="n">write</span><span class="p">(</span><span class="n">x</span><span class="o">/</span><span class="mi">10</span><span class="p">);</span>
<span class="linenos" data-linenos="20 "></span>    <span class="n">putchar</span><span class="p">(</span><span class="n">x</span><span class="o">%</span><span class="mi">10</span><span class="o">+</span><span class="sc">&#39;0&#39;</span><span class="p">);</span>
<span class="linenos" data-linenos="21 "></span><span class="p">}</span>
<span class="linenos" data-linenos="22 "></span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span> <span class="n">q</span><span class="p">[</span><span class="n">maxn</span><span class="p">];</span>
<span class="linenos" data-linenos="23 "></span><span class="kt">int</span> <span class="n">lm</span><span class="p">[</span><span class="n">maxn</span><span class="o">*</span><span class="mi">2</span><span class="p">],</span><span class="n">rm</span><span class="p">[</span><span class="n">maxn</span><span class="o">*</span><span class="mi">2</span><span class="p">],</span><span class="n">wzp</span><span class="p">[</span><span class="n">maxn</span><span class="o">*</span><span class="mi">2</span><span class="p">],</span><span class="n">a</span><span class="p">[</span><span class="n">maxn</span><span class="p">];</span>
<span class="linenos" data-linenos="24 "></span><span class="kt">int</span> <span class="n">n</span><span class="p">,</span><span class="n">m</span><span class="p">,</span><span class="n">N</span><span class="p">,</span><span class="n">ask</span><span class="p">[</span><span class="n">maxn</span><span class="p">],</span><span class="n">ans</span><span class="p">[</span><span class="n">maxn</span><span class="p">],</span><span class="n">f</span><span class="p">[</span><span class="n">maxn</span><span class="p">],</span><span class="n">g</span><span class="p">[</span><span class="n">maxn</span><span class="p">],</span><span class="n">cnt</span><span class="p">[</span><span class="n">maxn</span><span class="p">],</span><span class="n">qid</span><span class="p">[</span><span class="n">maxn</span><span class="p">];</span>
<span class="linenos" data-linenos="25 "></span><span class="n">IL</span> <span class="kt">void</span> <span class="n">Max</span><span class="p">(</span><span class="kt">int</span> <span class="o">&amp;</span><span class="n">a</span><span class="p">,</span><span class="kt">int</span> <span class="n">b</span><span class="p">){</span><span class="k">if</span><span class="p">(</span><span class="n">a</span><span class="o">&lt;</span><span class="n">b</span><span class="p">)</span><span class="n">a</span><span class="o">=</span><span class="n">b</span><span class="p">;}</span>
<span class="linenos" data-linenos="26 "></span><span class="n">IL</span> <span class="kt">void</span> <span class="n">A2l</span><span class="p">(</span><span class="kt">int</span> <span class="n">x</span><span class="p">,</span><span class="kt">int</span> <span class="n">v</span><span class="p">){</span><span class="k">for</span><span class="p">(;</span><span class="n">x</span><span class="o">&lt;=</span><span class="n">N</span><span class="p">;</span><span class="n">x</span><span class="o">+=</span><span class="n">x</span><span class="o">&amp;-</span><span class="n">x</span><span class="p">)</span> <span class="n">Max</span><span class="p">(</span><span class="n">lm</span><span class="p">[</span><span class="n">x</span><span class="p">],</span><span class="n">v</span><span class="p">);}</span>
<span class="linenos" data-linenos="27 "></span><span class="n">IL</span> <span class="kt">void</span> <span class="n">A2r</span><span class="p">(</span><span class="kt">int</span> <span class="n">x</span><span class="p">,</span> <span class="kt">int</span> <span class="n">v</span><span class="p">){</span><span class="k">for</span><span class="p">(;</span><span class="n">x</span><span class="o">&gt;</span><span class="mi">0</span><span class="p">;</span><span class="n">x</span><span class="o">-=</span><span class="n">x</span><span class="o">&amp;-</span><span class="n">x</span><span class="p">)</span> <span class="n">Max</span><span class="p">(</span><span class="n">rm</span><span class="p">[</span><span class="n">x</span><span class="p">],</span><span class="n">v</span><span class="p">);}</span>
<span class="linenos" data-linenos="28 "></span><span class="n">IL</span> <span class="kt">int</span> <span class="n">Qml</span><span class="p">(</span><span class="kt">int</span> <span class="n">x</span><span class="p">){</span><span class="kt">int</span> <span class="n">v</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="k">for</span><span class="p">(;</span><span class="n">x</span><span class="o">&gt;</span><span class="mi">0</span><span class="p">;</span><span class="n">x</span><span class="o">-=</span><span class="n">x</span><span class="o">&amp;-</span><span class="n">x</span><span class="p">)</span> <span class="n">Max</span><span class="p">(</span><span class="n">v</span><span class="p">,</span><span class="n">lm</span><span class="p">[</span><span class="n">x</span><span class="p">]);</span> <span class="k">return</span> <span class="n">v</span><span class="p">;}</span>
<span class="linenos" data-linenos="29 "></span><span class="n">IL</span> <span class="kt">int</span> <span class="n">Qmr</span><span class="p">(</span><span class="kt">int</span> <span class="n">x</span><span class="p">){</span><span class="kt">int</span> <span class="n">v</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="k">for</span><span class="p">(;</span><span class="n">x</span><span class="o">&lt;=</span><span class="n">N</span><span class="p">;</span><span class="n">x</span><span class="o">+=</span><span class="n">x</span><span class="o">&amp;-</span><span class="n">x</span><span class="p">)</span> <span class="n">Max</span><span class="p">(</span><span class="n">v</span><span class="p">,</span><span class="n">rm</span><span class="p">[</span><span class="n">x</span><span class="p">]);</span> <span class="k">return</span> <span class="n">v</span><span class="p">;}</span>
<span class="linenos" data-linenos="30 "></span><span class="kt">int</span> <span class="n">main</span><span class="p">()</span> <span class="p">{</span>
<span class="linenos" data-linenos="31 "></span>    <span class="c1">//freopen(&quot;lis.in&quot;,&quot;r&quot;,stdin);</span>
<span class="linenos" data-linenos="32 "></span>    <span class="c1">//freopen(&quot;lis.out&quot;,&quot;w&quot;,stdout);</span>
<span class="linenos" data-linenos="33 "></span>    <span class="n">n</span> <span class="o">=</span> <span class="n">read</span><span class="p">(),</span><span class="n">m</span> <span class="o">=</span> <span class="n">read</span><span class="p">();</span>
<span class="linenos" data-linenos="34 "></span>    <span class="n">Rep</span><span class="p">(</span><span class="n">i</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="n">n</span><span class="p">)</span><span class="n">wzp</span><span class="p">[</span><span class="o">++</span><span class="n">N</span><span class="p">]</span> <span class="o">=</span> <span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="n">read</span><span class="p">();</span>
<span class="linenos" data-linenos="35 "></span>    <span class="n">Rep</span><span class="p">(</span><span class="n">i</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="n">m</span><span class="p">){</span>
<span class="linenos" data-linenos="36 "></span>        <span class="n">qid</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="n">read</span><span class="p">(),</span><span class="n">ask</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="n">read</span><span class="p">();</span>
<span class="linenos" data-linenos="37 "></span>        <span class="n">q</span><span class="p">[</span><span class="n">qid</span><span class="p">[</span><span class="n">i</span><span class="p">]].</span><span class="n">push_back</span><span class="p">(</span><span class="n">i</span><span class="p">);</span>
<span class="linenos" data-linenos="38 "></span>        <span class="n">wzp</span><span class="p">[</span><span class="o">++</span><span class="n">N</span><span class="p">]</span> <span class="o">=</span> <span class="n">ask</span><span class="p">[</span><span class="n">i</span><span class="p">];</span>
<span class="linenos" data-linenos="39 "></span>        <span class="n">ans</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="mi">1</span><span class="p">;</span>
<span class="linenos" data-linenos="40 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos="41 "></span>    <span class="n">sort</span><span class="p">(</span><span class="n">wzp</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span><span class="n">wzp</span><span class="o">+</span><span class="n">N</span><span class="o">+</span><span class="mi">1</span><span class="p">);</span>
<span class="linenos" data-linenos="42 "></span>    <span class="n">N</span> <span class="o">=</span> <span class="n">unique</span><span class="p">(</span><span class="n">wzp</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span><span class="n">wzp</span><span class="o">+</span><span class="n">N</span><span class="o">+</span><span class="mi">1</span><span class="p">)</span> <span class="o">-</span> <span class="n">wzp</span><span class="mi">-1</span><span class="p">;</span>
<span class="linenos" data-linenos="43 "></span>    <span class="n">Rep</span><span class="p">(</span><span class="n">i</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="n">n</span><span class="p">)</span> <span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="n">lower_bound</span><span class="p">(</span><span class="n">wzp</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span><span class="n">wzp</span><span class="o">+</span><span class="mi">1</span><span class="o">+</span><span class="n">N</span><span class="p">,</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">])</span><span class="o">-</span><span class="n">wzp</span><span class="p">;</span>
<span class="linenos" data-linenos="44 "></span>    <span class="n">Rep</span><span class="p">(</span><span class="n">i</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="n">m</span><span class="p">)</span> <span class="n">ask</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="n">lower_bound</span><span class="p">(</span><span class="n">wzp</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span><span class="n">wzp</span><span class="o">+</span><span class="mi">1</span><span class="o">+</span><span class="n">N</span><span class="p">,</span><span class="n">ask</span><span class="p">[</span><span class="n">i</span><span class="p">])</span><span class="o">-</span><span class="n">wzp</span><span class="p">;</span>
<span class="linenos" data-linenos="45 "></span>    <span class="kt">int</span> <span class="n">lgst</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span>
<span class="linenos" data-linenos="46 "></span>    <span class="n">Rep</span><span class="p">(</span><span class="n">i</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="n">n</span><span class="p">){</span>
<span class="linenos" data-linenos="47 "></span>        <span class="k">for</span><span class="p">(</span><span class="kt">unsigned</span> <span class="n">e</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">e</span><span class="o">&lt;</span><span class="n">q</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">size</span><span class="p">();</span><span class="o">++</span><span class="n">e</span><span class="p">){</span>
<span class="linenos" data-linenos="48 "></span>            <span class="kt">int</span> <span class="n">j</span><span class="o">=</span><span class="n">q</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="n">e</span><span class="p">];</span>
<span class="linenos" data-linenos="49 "></span>            <span class="n">ans</span><span class="p">[</span><span class="n">j</span><span class="p">]</span> <span class="o">+=</span> <span class="n">Qml</span><span class="p">(</span><span class="n">ask</span><span class="p">[</span><span class="n">j</span><span class="p">]</span><span class="mi">-1</span><span class="p">);</span>
<span class="linenos" data-linenos="50 "></span>        <span class="p">}</span>
<span class="linenos" data-linenos="51 "></span>        <span class="n">f</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="n">Qml</span><span class="p">(</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="mi">-1</span><span class="p">)</span><span class="o">+</span><span class="mi">1</span><span class="p">;</span>
<span class="linenos" data-linenos="52 "></span>        <span class="n">A2l</span><span class="p">(</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">],</span><span class="n">f</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span> <span class="n">lgst</span> <span class="o">=</span> <span class="n">max</span><span class="p">(</span><span class="n">lgst</span><span class="p">,</span> <span class="n">f</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
<span class="linenos" data-linenos="53 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos="54 "></span>    <span class="n">Dep</span><span class="p">(</span><span class="n">i</span><span class="p">,</span><span class="n">n</span><span class="p">,</span><span class="mi">1</span><span class="p">){</span>
<span class="linenos" data-linenos="55 "></span>        <span class="n">rep</span><span class="p">(</span><span class="n">e</span><span class="p">,</span><span class="mi">0</span><span class="p">,</span><span class="n">q</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">size</span><span class="p">())</span>
<span class="linenos" data-linenos="56 "></span>            <span class="n">ans</span><span class="p">[</span><span class="n">q</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="n">e</span><span class="p">]]</span> <span class="o">+=</span> <span class="n">Qmr</span><span class="p">(</span><span class="n">ask</span><span class="p">[</span><span class="n">q</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="n">e</span><span class="p">]]</span><span class="o">+</span><span class="mi">1</span><span class="p">);</span>
<span class="linenos" data-linenos="57 "></span>        <span class="n">g</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="n">Qmr</span><span class="p">(</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">+</span><span class="mi">1</span><span class="p">)</span><span class="o">+</span><span class="mi">1</span><span class="p">;</span> <span class="n">A2r</span><span class="p">(</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">],</span> <span class="n">g</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
<span class="linenos" data-linenos="58 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos="59 "></span>    <span class="kt">long</span> <span class="kt">long</span> <span class="n">Ans</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span>
<span class="linenos" data-linenos="60 "></span>    <span class="n">Ans</span> <span class="o">^=</span> <span class="n">lgst</span><span class="p">;</span>
<span class="linenos" data-linenos="61 "></span>    <span class="n">Rep</span><span class="p">(</span><span class="n">i</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="n">n</span><span class="p">)</span> <span class="k">if</span><span class="p">(</span><span class="n">f</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">+</span><span class="n">g</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">==</span><span class="n">lgst</span><span class="o">+</span><span class="mi">1</span><span class="p">)</span> <span class="o">++</span> <span class="n">cnt</span><span class="p">[</span><span class="n">f</span><span class="p">[</span><span class="n">i</span><span class="p">]];</span>
<span class="linenos" data-linenos="62 "></span>    <span class="n">Rep</span><span class="p">(</span><span class="n">i</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="n">m</span><span class="p">)</span>
<span class="linenos" data-linenos="63 "></span>        <span class="k">if</span><span class="p">(</span><span class="n">f</span><span class="p">[</span><span class="n">qid</span><span class="p">[</span><span class="n">i</span><span class="p">]]</span> <span class="o">+</span> <span class="n">g</span><span class="p">[</span><span class="n">qid</span><span class="p">[</span><span class="n">i</span><span class="p">]]</span> <span class="o">==</span> <span class="n">lgst</span> <span class="o">+</span> <span class="mi">1</span> <span class="o">&amp;&amp;</span> <span class="mi">1</span> <span class="o">==</span> <span class="n">cnt</span><span class="p">[</span><span class="n">f</span><span class="p">[</span><span class="n">qid</span><span class="p">[</span><span class="n">i</span><span class="p">]]])</span>
<span class="linenos" data-linenos="64 "></span>            <span class="n">write</span><span class="p">((</span><span class="kt">long</span> <span class="kt">long</span><span class="p">)</span><span class="n">max</span><span class="p">(</span><span class="n">ans</span><span class="p">[</span><span class="n">i</span><span class="p">],</span> <span class="n">lgst</span><span class="mi">-1</span><span class="p">)),</span><span class="n">putchar</span><span class="p">(</span><span class="sc">&#39;\n&#39;</span><span class="p">);</span>
<span class="linenos" data-linenos="65 "></span>        <span class="k">else</span>
<span class="linenos" data-linenos="66 "></span>            <span class="nf">write</span><span class="p">((</span><span class="kt">long</span> <span class="kt">long</span><span class="p">)</span><span class="n">max</span><span class="p">(</span><span class="n">ans</span><span class="p">[</span><span class="n">i</span><span class="p">],</span> <span class="n">lgst</span><span class="p">)),</span><span class="n">putchar</span><span class="p">(</span><span class="sc">&#39;\n&#39;</span><span class="p">);</span>
<span class="linenos" data-linenos="67 "></span>    <span class="c1">//printf(&quot;%lld\n&quot;,Ans);</span>
<span class="linenos" data-linenos="68 "></span>    <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
<span class="linenos" data-linenos="69 "></span><span class="p">}</span>
</code></pre></div>
当然，如果内存允许，可以强行主席树
<div class="highlight"><pre><span></span><code><span class="linenos" data-linenos="  1 "></span><span class="cp">#include</span><span class="cpf">&lt;bits/stdc++.h&gt;</span><span class="cp"></span>
<span class="linenos" data-linenos="  2 "></span><span class="k">using</span> <span class="k">namespace</span> <span class="n">std</span><span class="p">;</span>
<span class="linenos" data-linenos="  3 "></span><span class="kr">inline</span> <span class="kt">int</span> <span class="n">read</span><span class="p">(){</span>
<span class="linenos" data-linenos="  4 "></span>    <span class="kt">int</span> <span class="n">x</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="kt">char</span> <span class="n">c</span><span class="o">=</span><span class="n">getchar</span><span class="p">();</span><span class="kt">bool</span> <span class="n">f</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span>
<span class="linenos" data-linenos="  5 "></span>    <span class="k">for</span><span class="p">(;</span><span class="o">!</span><span class="n">isdigit</span><span class="p">(</span><span class="n">c</span><span class="p">);</span><span class="n">c</span><span class="o">=</span><span class="n">getchar</span><span class="p">())</span><span class="n">f</span><span class="o">^=</span><span class="n">c</span><span class="o">==</span><span class="sc">&#39;-&#39;</span><span class="p">;</span>
<span class="linenos" data-linenos="  6 "></span>    <span class="k">for</span><span class="p">(;</span><span class="n">isdigit</span><span class="p">(</span><span class="n">c</span><span class="p">);</span><span class="n">c</span><span class="o">=</span><span class="n">getchar</span><span class="p">())</span><span class="n">x</span><span class="o">=</span><span class="p">(</span><span class="n">x</span><span class="o">&lt;&lt;</span><span class="mi">1</span><span class="p">)</span><span class="o">+</span><span class="p">(</span><span class="n">x</span><span class="o">&lt;&lt;</span><span class="mi">3</span><span class="p">)</span><span class="o">+</span><span class="n">c</span><span class="o">-</span><span class="sc">&#39;0&#39;</span><span class="p">;</span>
<span class="linenos" data-linenos="  7 "></span>    <span class="k">if</span><span class="p">(</span><span class="n">f</span><span class="p">)</span><span class="n">x</span><span class="o">=-</span><span class="n">x</span><span class="p">;</span><span class="k">return</span> <span class="n">x</span><span class="p">;</span>
<span class="linenos" data-linenos="  8 "></span><span class="p">}</span>
<span class="linenos" data-linenos="  9 "></span><span class="kt">void</span> <span class="n">write</span><span class="p">(</span><span class="kt">int</span> <span class="n">x</span><span class="p">){</span>
<span class="linenos" data-linenos=" 10 "></span>    <span class="k">if</span><span class="p">(</span><span class="n">x</span><span class="o">&lt;</span><span class="mi">0</span><span class="p">)</span><span class="n">putchar</span><span class="p">(</span><span class="sc">&#39;-&#39;</span><span class="p">),</span><span class="n">x</span><span class="o">=-</span><span class="n">x</span><span class="p">;</span>
<span class="linenos" data-linenos=" 11 "></span>    <span class="k">if</span><span class="p">(</span><span class="n">x</span><span class="o">&gt;=</span><span class="mi">10</span><span class="p">)</span><span class="n">write</span><span class="p">(</span><span class="n">x</span><span class="o">/</span><span class="mi">10</span><span class="p">);</span>
<span class="linenos" data-linenos=" 12 "></span>    <span class="n">putchar</span><span class="p">(</span><span class="n">x</span><span class="o">%</span><span class="mi">10</span><span class="o">+</span><span class="sc">&#39;0&#39;</span><span class="p">);</span>
<span class="linenos" data-linenos=" 13 "></span><span class="p">}</span>
<span class="linenos" data-linenos=" 14 "></span><span class="k">const</span> <span class="kt">int</span> <span class="n">maxn</span><span class="o">=</span><span class="mf">4e5</span><span class="o">+</span><span class="mi">10</span><span class="p">;</span>
<span class="linenos" data-linenos=" 15 "></span><span class="k">namespace</span> <span class="n">TREE</span><span class="p">{</span>
<span class="linenos" data-linenos=" 16 "></span>    <span class="k">struct</span> <span class="nc">node</span><span class="p">{</span>
<span class="linenos" data-linenos=" 17 "></span>        <span class="kt">int</span> <span class="n">l</span><span class="p">,</span><span class="n">r</span><span class="p">;</span>
<span class="linenos" data-linenos=" 18 "></span>        <span class="kt">int</span> <span class="n">lson</span><span class="p">,</span><span class="n">rson</span><span class="p">;</span>
<span class="linenos" data-linenos=" 19 "></span>        <span class="kt">int</span> <span class="n">val</span><span class="p">;</span>
<span class="linenos" data-linenos=" 20 "></span>        <span class="cp">#define l(x) tree[x].l</span>
<span class="linenos" data-linenos=" 21 "></span>        <span class="cp">#define r(x) tree[x].r</span>
<span class="linenos" data-linenos=" 22 "></span>        <span class="cp">#define lson(x) tree[x].lson</span>
<span class="linenos" data-linenos=" 23 "></span>        <span class="cp">#define rson(x) tree[x].rson</span>
<span class="linenos" data-linenos=" 24 "></span>        <span class="cp">#define val(x) tree[x].val</span>
<span class="linenos" data-linenos=" 25 "></span>    <span class="p">}</span><span class="n">tree</span><span class="p">[</span><span class="n">maxn</span><span class="o">&lt;&lt;</span><span class="mi">4</span><span class="p">];</span>
<span class="linenos" data-linenos=" 26 "></span>    <span class="kt">int</span> <span class="n">cnt</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span>
<span class="linenos" data-linenos=" 27 "></span>    <span class="kt">void</span> <span class="nf">build</span><span class="p">(</span><span class="kt">int</span> <span class="n">now</span><span class="p">,</span><span class="kt">int</span> <span class="n">l</span><span class="p">,</span><span class="kt">int</span> <span class="n">r</span><span class="p">){</span>
<span class="linenos" data-linenos=" 28 "></span>        <span class="n">l</span><span class="p">(</span><span class="n">now</span><span class="p">)</span><span class="o">=</span><span class="n">l</span><span class="p">,</span><span class="n">r</span><span class="p">(</span><span class="n">now</span><span class="p">)</span><span class="o">=</span><span class="n">r</span><span class="p">;</span>
<span class="linenos" data-linenos=" 29 "></span>        <span class="n">val</span><span class="p">(</span><span class="n">now</span><span class="p">)</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span>
<span class="linenos" data-linenos=" 30 "></span>        <span class="k">if</span><span class="p">(</span><span class="n">l</span><span class="o">==</span><span class="n">r</span><span class="p">)</span><span class="k">return</span><span class="p">;</span>
<span class="linenos" data-linenos=" 31 "></span>        <span class="kt">int</span> <span class="n">mid</span><span class="o">=</span><span class="n">l</span><span class="o">+</span><span class="n">r</span><span class="o">&gt;&gt;</span><span class="mi">1</span><span class="p">;</span>
<span class="linenos" data-linenos=" 32 "></span>        <span class="n">lson</span><span class="p">(</span><span class="n">now</span><span class="p">)</span><span class="o">=++</span><span class="n">cnt</span><span class="p">;</span><span class="n">build</span><span class="p">(</span><span class="n">cnt</span><span class="p">,</span><span class="n">l</span><span class="p">,</span><span class="n">mid</span><span class="p">);</span>
<span class="linenos" data-linenos=" 33 "></span>        <span class="n">rson</span><span class="p">(</span><span class="n">now</span><span class="p">)</span><span class="o">=++</span><span class="n">cnt</span><span class="p">;</span><span class="n">build</span><span class="p">(</span><span class="n">cnt</span><span class="p">,</span><span class="n">mid</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span><span class="n">r</span><span class="p">);</span>
<span class="linenos" data-linenos=" 34 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos=" 35 "></span>    <span class="kt">int</span> <span class="nf">init</span><span class="p">(</span><span class="kt">int</span> <span class="n">n</span><span class="p">){</span>
<span class="linenos" data-linenos=" 36 "></span>        <span class="kt">int</span> <span class="n">rt</span><span class="o">=++</span><span class="n">cnt</span><span class="p">;</span>
<span class="linenos" data-linenos=" 37 "></span>        <span class="n">build</span><span class="p">(</span><span class="n">rt</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="n">n</span><span class="p">);</span>
<span class="linenos" data-linenos=" 38 "></span>        <span class="k">return</span> <span class="n">rt</span><span class="p">;</span>
<span class="linenos" data-linenos=" 39 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos=" 40 "></span>    <span class="kt">void</span> <span class="nf">change</span><span class="p">(</span><span class="kt">int</span> <span class="n">now</span><span class="p">,</span><span class="kt">int</span> <span class="n">last</span><span class="p">,</span><span class="kt">int</span> <span class="n">pos</span><span class="p">,</span><span class="kt">int</span> <span class="n">val</span><span class="p">){</span>
<span class="linenos" data-linenos=" 41 "></span>        <span class="n">tree</span><span class="p">[</span><span class="n">now</span><span class="p">]</span><span class="o">=</span><span class="n">tree</span><span class="p">[</span><span class="n">last</span><span class="p">];</span>
<span class="linenos" data-linenos=" 42 "></span>        <span class="k">if</span><span class="p">(</span><span class="n">l</span><span class="p">(</span><span class="n">now</span><span class="p">)</span><span class="o">==</span><span class="n">r</span><span class="p">(</span><span class="n">now</span><span class="p">)){</span>
<span class="linenos" data-linenos=" 43 "></span>            <span class="n">val</span><span class="p">(</span><span class="n">now</span><span class="p">)</span><span class="o">=</span><span class="n">max</span><span class="p">(</span><span class="n">val</span><span class="p">(</span><span class="n">now</span><span class="p">),</span><span class="n">val</span><span class="p">);</span>
<span class="linenos" data-linenos=" 44 "></span>            <span class="k">return</span><span class="p">;</span>
<span class="linenos" data-linenos=" 45 "></span>        <span class="p">}</span>
<span class="linenos" data-linenos=" 46 "></span>        <span class="kt">int</span> <span class="n">mid</span><span class="o">=</span><span class="n">l</span><span class="p">(</span><span class="n">now</span><span class="p">)</span><span class="o">+</span><span class="n">r</span><span class="p">(</span><span class="n">now</span><span class="p">)</span><span class="o">&gt;&gt;</span><span class="mi">1</span><span class="p">;</span>
<span class="linenos" data-linenos=" 47 "></span>        <span class="k">if</span><span class="p">(</span><span class="n">pos</span><span class="o">&lt;=</span><span class="n">mid</span><span class="p">){</span>
<span class="linenos" data-linenos=" 48 "></span>            <span class="n">lson</span><span class="p">(</span><span class="n">now</span><span class="p">)</span><span class="o">=++</span><span class="n">cnt</span><span class="p">;</span>
<span class="linenos" data-linenos=" 49 "></span>            <span class="n">change</span><span class="p">(</span><span class="n">cnt</span><span class="p">,</span><span class="n">lson</span><span class="p">(</span><span class="n">last</span><span class="p">),</span><span class="n">pos</span><span class="p">,</span><span class="n">val</span><span class="p">);</span>
<span class="linenos" data-linenos=" 50 "></span>        <span class="p">}</span>
<span class="linenos" data-linenos=" 51 "></span>        <span class="k">else</span><span class="p">{</span>
<span class="linenos" data-linenos=" 52 "></span>            <span class="n">rson</span><span class="p">(</span><span class="n">now</span><span class="p">)</span><span class="o">=++</span><span class="n">cnt</span><span class="p">;</span>
<span class="linenos" data-linenos=" 53 "></span>            <span class="n">change</span><span class="p">(</span><span class="n">cnt</span><span class="p">,</span><span class="n">rson</span><span class="p">(</span><span class="n">last</span><span class="p">),</span><span class="n">pos</span><span class="p">,</span><span class="n">val</span><span class="p">);</span>
<span class="linenos" data-linenos=" 54 "></span>        <span class="p">}</span>
<span class="linenos" data-linenos=" 55 "></span>        <span class="n">val</span><span class="p">(</span><span class="n">now</span><span class="p">)</span><span class="o">=</span><span class="n">max</span><span class="p">(</span><span class="n">val</span><span class="p">(</span><span class="n">lson</span><span class="p">(</span><span class="n">now</span><span class="p">)),</span><span class="n">val</span><span class="p">(</span><span class="n">rson</span><span class="p">(</span><span class="n">now</span><span class="p">)));</span>
<span class="linenos" data-linenos=" 56 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos=" 57 "></span>    <span class="kt">int</span> <span class="nf">update</span><span class="p">(</span><span class="kt">int</span> <span class="n">k</span><span class="p">,</span><span class="kt">int</span> <span class="n">pos</span><span class="p">,</span><span class="kt">int</span> <span class="n">val</span><span class="p">){</span>
<span class="linenos" data-linenos=" 58 "></span>        <span class="kt">int</span> <span class="n">rt</span><span class="o">=++</span><span class="n">cnt</span><span class="p">;</span>
<span class="linenos" data-linenos=" 59 "></span>        <span class="n">change</span><span class="p">(</span><span class="n">rt</span><span class="p">,</span><span class="n">k</span><span class="p">,</span><span class="n">pos</span><span class="p">,</span><span class="n">val</span><span class="p">);</span>
<span class="linenos" data-linenos=" 60 "></span>        <span class="k">return</span> <span class="n">rt</span><span class="p">;</span>
<span class="linenos" data-linenos=" 61 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos=" 62 "></span>    <span class="kt">int</span> <span class="nf">query</span><span class="p">(</span><span class="kt">int</span> <span class="n">now</span><span class="p">,</span><span class="kt">int</span> <span class="n">l</span><span class="p">,</span><span class="kt">int</span> <span class="n">r</span><span class="p">){</span>
<span class="linenos" data-linenos=" 63 "></span>        <span class="k">if</span><span class="p">(</span><span class="n">l</span><span class="o">&lt;=</span><span class="n">l</span><span class="p">(</span><span class="n">now</span><span class="p">)</span><span class="o">&amp;&amp;</span><span class="n">r</span><span class="p">(</span><span class="n">now</span><span class="p">)</span><span class="o">&lt;=</span><span class="n">r</span><span class="p">)</span><span class="k">return</span> <span class="n">val</span><span class="p">(</span><span class="n">now</span><span class="p">);</span>
<span class="linenos" data-linenos=" 64 "></span>        <span class="k">if</span><span class="p">(</span><span class="n">l</span><span class="o">&gt;</span><span class="n">r</span><span class="p">(</span><span class="n">now</span><span class="p">)</span><span class="o">||</span><span class="n">r</span><span class="o">&lt;</span><span class="n">l</span><span class="p">(</span><span class="n">now</span><span class="p">))</span><span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
<span class="linenos" data-linenos=" 65 "></span>        <span class="k">return</span> <span class="n">max</span><span class="p">(</span><span class="n">query</span><span class="p">(</span><span class="n">lson</span><span class="p">(</span><span class="n">now</span><span class="p">),</span><span class="n">l</span><span class="p">,</span><span class="n">r</span><span class="p">),</span><span class="n">query</span><span class="p">(</span><span class="n">rson</span><span class="p">(</span><span class="n">now</span><span class="p">),</span><span class="n">l</span><span class="p">,</span><span class="n">r</span><span class="p">));</span>
<span class="linenos" data-linenos=" 66 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos=" 67 "></span><span class="p">}</span>
<span class="linenos" data-linenos=" 68 "></span><span class="k">using</span> <span class="k">namespace</span> <span class="n">TREE</span><span class="p">;</span>
<span class="linenos" data-linenos=" 69 "></span><span class="kt">int</span> <span class="n">n</span><span class="p">,</span><span class="n">m</span><span class="p">;</span>
<span class="linenos" data-linenos=" 70 "></span><span class="kt">int</span> <span class="n">a</span><span class="p">[</span><span class="n">maxn</span><span class="p">];</span>
<span class="linenos" data-linenos=" 71 "></span><span class="n">set</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="n">S</span><span class="p">;</span>
<span class="linenos" data-linenos=" 72 "></span><span class="n">map</span><span class="o">&lt;</span><span class="kt">int</span><span class="p">,</span><span class="kt">int</span><span class="o">&gt;</span><span class="n">M</span><span class="p">;</span>
<span class="linenos" data-linenos=" 73 "></span><span class="kt">int</span> <span class="n">tot</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span>
<span class="linenos" data-linenos=" 74 "></span><span class="k">struct</span> <span class="nc">NNN</span><span class="p">{</span>
<span class="linenos" data-linenos=" 75 "></span>    <span class="kt">int</span> <span class="n">a</span><span class="p">,</span><span class="n">b</span><span class="p">;</span>
<span class="linenos" data-linenos=" 76 "></span>    <span class="kt">void</span> <span class="nf">in</span><span class="p">(){</span><span class="n">a</span><span class="o">=</span><span class="n">read</span><span class="p">();</span><span class="n">b</span><span class="o">=</span><span class="n">read</span><span class="p">();}</span>
<span class="linenos" data-linenos=" 77 "></span><span class="p">}</span><span class="n">cmd</span><span class="p">[</span><span class="n">maxn</span><span class="p">];</span>
<span class="linenos" data-linenos=" 78 "></span><span class="kt">int</span> <span class="n">g</span><span class="p">[</span><span class="n">maxn</span><span class="p">],</span><span class="n">f</span><span class="p">[</span><span class="n">maxn</span><span class="p">];</span>
<span class="linenos" data-linenos=" 79 "></span><span class="kt">int</span> <span class="n">pos</span><span class="p">[</span><span class="n">maxn</span><span class="p">];</span>
<span class="linenos" data-linenos=" 80 "></span><span class="kt">int</span> <span class="n">root1</span><span class="p">[</span><span class="n">maxn</span><span class="p">],</span><span class="n">root2</span><span class="p">[</span><span class="n">maxn</span><span class="p">];</span>
<span class="linenos" data-linenos=" 81 "></span><span class="kt">signed</span> <span class="nf">main</span><span class="p">(){</span>
<span class="linenos" data-linenos=" 82 "></span>    <span class="n">n</span><span class="o">=</span><span class="n">read</span><span class="p">();</span><span class="n">m</span><span class="o">=</span><span class="n">read</span><span class="p">();</span>
<span class="linenos" data-linenos=" 83 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;=</span><span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span>
<span class="linenos" data-linenos=" 84 "></span>        <span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=</span><span class="n">read</span><span class="p">(),</span><span class="n">S</span><span class="p">.</span><span class="n">insert</span><span class="p">(</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
<span class="linenos" data-linenos=" 85 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;=</span><span class="n">m</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span>
<span class="linenos" data-linenos=" 86 "></span>        <span class="n">cmd</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">in</span><span class="p">(),</span><span class="n">S</span><span class="p">.</span><span class="n">insert</span><span class="p">(</span><span class="n">cmd</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">b</span><span class="p">);</span>
<span class="linenos" data-linenos=" 87 "></span>    <span class="k">for</span><span class="p">(</span><span class="n">set</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;::</span><span class="n">iterator</span> <span class="n">it</span><span class="o">=</span><span class="n">S</span><span class="p">.</span><span class="n">begin</span><span class="p">();</span><span class="n">it</span><span class="o">!=</span><span class="n">S</span><span class="p">.</span><span class="n">end</span><span class="p">();</span><span class="n">it</span><span class="o">++</span><span class="p">)</span>
<span class="linenos" data-linenos=" 88 "></span>        <span class="n">M</span><span class="p">[</span><span class="o">*</span><span class="n">it</span><span class="p">]</span><span class="o">=++</span><span class="n">tot</span><span class="p">;</span>
<span class="linenos" data-linenos=" 89 "></span>    <span class="n">root1</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span><span class="o">=</span><span class="n">root2</span><span class="p">[</span><span class="n">n</span><span class="o">+</span><span class="mi">1</span><span class="p">]</span><span class="o">=</span><span class="n">init</span><span class="p">(</span><span class="n">tot</span><span class="p">);</span>
<span class="linenos" data-linenos=" 90 "></span>    <span class="kt">int</span> <span class="n">len</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span>
<span class="linenos" data-linenos=" 91 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;=</span><span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">){</span>
<span class="linenos" data-linenos=" 92 "></span>        <span class="n">g</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=</span><span class="n">query</span><span class="p">(</span><span class="n">root1</span><span class="p">[</span><span class="n">i</span><span class="mi">-1</span><span class="p">],</span><span class="mi">1</span><span class="p">,</span><span class="n">M</span><span class="p">[</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]]</span><span class="mi">-1</span><span class="p">)</span><span class="o">+</span><span class="mi">1</span><span class="p">;</span>
<span class="linenos" data-linenos=" 93 "></span>        <span class="n">root1</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=</span><span class="n">update</span><span class="p">(</span><span class="n">root1</span><span class="p">[</span><span class="n">i</span><span class="mi">-1</span><span class="p">],</span><span class="n">M</span><span class="p">[</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]],</span><span class="n">g</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
<span class="linenos" data-linenos=" 94 "></span>        <span class="c1">//write(g[i]),putchar(&#39; &#39;);</span>
<span class="linenos" data-linenos=" 95 "></span>        <span class="n">len</span><span class="o">=</span><span class="n">max</span><span class="p">(</span><span class="n">len</span><span class="p">,</span><span class="n">g</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
<span class="linenos" data-linenos=" 96 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos=" 97 "></span>    <span class="c1">//putchar(&#39;\n&#39;);</span>
<span class="linenos" data-linenos=" 98 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">&gt;=</span><span class="mi">1</span><span class="p">;</span><span class="n">i</span><span class="o">--</span><span class="p">){</span>
<span class="linenos" data-linenos=" 99 "></span>        <span class="n">f</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=</span><span class="n">query</span><span class="p">(</span><span class="n">root2</span><span class="p">[</span><span class="n">i</span><span class="o">+</span><span class="mi">1</span><span class="p">],</span><span class="n">M</span><span class="p">[</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]]</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span><span class="n">tot</span><span class="p">)</span><span class="o">+</span><span class="mi">1</span><span class="p">;</span>
<span class="linenos" data-linenos="100 "></span>        <span class="n">root2</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=</span><span class="n">update</span><span class="p">(</span><span class="n">root2</span><span class="p">[</span><span class="n">i</span><span class="o">+</span><span class="mi">1</span><span class="p">],</span><span class="n">M</span><span class="p">[</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]],</span><span class="n">f</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
<span class="linenos" data-linenos="101 "></span>        <span class="c1">//write(f[i]),putchar(&#39; &#39;);</span>
<span class="linenos" data-linenos="102 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos="103 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;=</span><span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span>
<span class="linenos" data-linenos="104 "></span>        <span class="k">if</span><span class="p">(</span><span class="n">f</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">+</span><span class="n">g</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">==</span><span class="n">len</span><span class="o">+</span><span class="mi">1</span><span class="p">)</span>
<span class="linenos" data-linenos="105 "></span>            <span class="n">pos</span><span class="p">[</span><span class="n">f</span><span class="p">[</span><span class="n">i</span><span class="p">]]</span><span class="o">++</span><span class="p">;</span>
<span class="linenos" data-linenos="106 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;=</span><span class="n">m</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">){</span>
<span class="linenos" data-linenos="107 "></span>        <span class="kt">int</span> <span class="n">j</span><span class="o">=</span><span class="n">cmd</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">a</span><span class="p">,</span><span class="n">k</span><span class="o">=</span><span class="n">cmd</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">b</span><span class="p">;</span>
<span class="linenos" data-linenos="108 "></span>        <span class="k">if</span><span class="p">(</span><span class="n">f</span><span class="p">[</span><span class="n">j</span><span class="p">]</span><span class="o">+</span><span class="n">g</span><span class="p">[</span><span class="n">j</span><span class="p">]</span><span class="o">==</span><span class="n">len</span><span class="o">+</span><span class="mi">1</span><span class="o">&amp;&amp;</span><span class="n">pos</span><span class="p">[</span><span class="n">f</span><span class="p">[</span><span class="n">j</span><span class="p">]]</span><span class="o">==</span><span class="mi">1</span><span class="p">)</span>
<span class="linenos" data-linenos="109 "></span>            <span class="n">write</span><span class="p">(</span><span class="n">max</span><span class="p">(</span><span class="n">len</span><span class="mi">-1</span><span class="p">,</span><span class="mi">1</span><span class="o">+</span><span class="n">query</span><span class="p">(</span><span class="n">root1</span><span class="p">[</span><span class="n">j</span><span class="mi">-1</span><span class="p">],</span><span class="mi">1</span><span class="p">,</span><span class="n">M</span><span class="p">[</span><span class="n">k</span><span class="p">]</span><span class="mi">-1</span><span class="p">)</span><span class="o">+</span><span class="n">query</span><span class="p">(</span><span class="n">root2</span><span class="p">[</span><span class="n">j</span><span class="o">+</span><span class="mi">1</span><span class="p">],</span><span class="n">M</span><span class="p">[</span><span class="n">k</span><span class="p">]</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span><span class="n">tot</span><span class="p">))),</span><span class="n">putchar</span><span class="p">(</span><span class="sc">&#39;\n&#39;</span><span class="p">);</span>
<span class="linenos" data-linenos="110 "></span>        <span class="k">else</span>   
<span class="linenos" data-linenos="111 "></span>            <span class="n">write</span><span class="p">(</span><span class="n">max</span><span class="p">(</span><span class="n">len</span><span class="p">,</span><span class="mi">1</span><span class="o">+</span><span class="n">query</span><span class="p">(</span><span class="n">root1</span><span class="p">[</span><span class="n">j</span><span class="mi">-1</span><span class="p">],</span><span class="mi">1</span><span class="p">,</span><span class="n">M</span><span class="p">[</span><span class="n">k</span><span class="p">]</span><span class="mi">-1</span><span class="p">)</span><span class="o">+</span><span class="n">query</span><span class="p">(</span><span class="n">root2</span><span class="p">[</span><span class="n">j</span><span class="o">+</span><span class="mi">1</span><span class="p">],</span><span class="n">M</span><span class="p">[</span><span class="n">k</span><span class="p">]</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span><span class="n">tot</span><span class="p">))),</span><span class="n">putchar</span><span class="p">(</span><span class="sc">&#39;\n&#39;</span><span class="p">);</span>
<span class="linenos" data-linenos="112 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos="113 "></span><span class="p">}</span>
</code></pre></div>
当然，用线段树也完全ok
<div class="highlight"><pre><span></span><code><span class="linenos" data-linenos=" 1 "></span><span class="cp">#pragma GCC optimize(3,&quot;Ofast&quot;,&quot;inline&quot;)</span>
<span class="linenos" data-linenos=" 2 "></span><span class="cp">#include</span><span class="cpf">&lt;bits/stdc++.h&gt;</span><span class="cp"></span>
<span class="linenos" data-linenos=" 3 "></span><span class="k">using</span> <span class="k">namespace</span> <span class="n">std</span><span class="p">;</span>
<span class="linenos" data-linenos=" 4 "></span><span class="kr">inline</span> <span class="kt">int</span> <span class="n">read</span><span class="p">(){</span>
<span class="linenos" data-linenos=" 5 "></span>    <span class="kt">int</span> <span class="n">x</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="kt">char</span> <span class="n">c</span><span class="o">=</span><span class="n">getchar</span><span class="p">();</span><span class="kt">bool</span> <span class="n">f</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span>
<span class="linenos" data-linenos=" 6 "></span>    <span class="k">for</span><span class="p">(;</span><span class="o">!</span><span class="n">isdigit</span><span class="p">(</span><span class="n">c</span><span class="p">);</span><span class="n">c</span><span class="o">=</span><span class="n">getchar</span><span class="p">())</span><span class="n">f</span><span class="o">^=</span><span class="n">c</span><span class="o">==</span><span class="sc">&#39;-&#39;</span><span class="p">;</span>
<span class="linenos" data-linenos=" 7 "></span>    <span class="k">for</span><span class="p">(;</span><span class="n">isdigit</span><span class="p">(</span><span class="n">c</span><span class="p">);</span><span class="n">c</span><span class="o">=</span><span class="n">getchar</span><span class="p">())</span><span class="n">x</span><span class="o">=</span><span class="p">(</span><span class="n">x</span><span class="o">&lt;&lt;</span><span class="mi">1</span><span class="p">)</span><span class="o">+</span><span class="p">(</span><span class="n">x</span><span class="o">&lt;&lt;</span><span class="mi">3</span><span class="p">)</span><span class="o">+</span><span class="n">c</span><span class="o">-</span><span class="sc">&#39;0&#39;</span><span class="p">;</span>
<span class="linenos" data-linenos=" 8 "></span>    <span class="k">if</span><span class="p">(</span><span class="n">f</span><span class="p">)</span><span class="n">x</span><span class="o">=-</span><span class="n">x</span><span class="p">;</span><span class="k">return</span> <span class="n">x</span><span class="p">;</span>
<span class="linenos" data-linenos=" 9 "></span><span class="p">}</span>
<span class="linenos" data-linenos="10 "></span><span class="kt">void</span> <span class="n">write</span><span class="p">(</span><span class="kt">int</span> <span class="n">x</span><span class="p">){</span>
<span class="linenos" data-linenos="11 "></span>    <span class="k">if</span><span class="p">(</span><span class="n">x</span><span class="o">&lt;</span><span class="mi">0</span><span class="p">)</span><span class="n">putchar</span><span class="p">(</span><span class="sc">&#39;-&#39;</span><span class="p">),</span><span class="n">x</span><span class="o">=-</span><span class="n">x</span><span class="p">;</span>
<span class="linenos" data-linenos="12 "></span>    <span class="k">if</span><span class="p">(</span><span class="n">x</span><span class="o">&gt;=</span><span class="mi">10</span><span class="p">)</span><span class="n">write</span><span class="p">(</span><span class="n">x</span><span class="o">/</span><span class="mi">10</span><span class="p">);</span>
<span class="linenos" data-linenos="13 "></span>    <span class="n">putchar</span><span class="p">(</span><span class="n">x</span><span class="o">%</span><span class="mi">10</span><span class="o">+</span><span class="sc">&#39;0&#39;</span><span class="p">);</span>
<span class="linenos" data-linenos="14 "></span><span class="p">}</span>
<span class="linenos" data-linenos="15 "></span><span class="k">const</span> <span class="kt">int</span> <span class="n">maxn</span><span class="o">=</span><span class="mf">4e5</span><span class="o">+</span><span class="mi">10</span><span class="p">;</span>
<span class="linenos" data-linenos="16 "></span><span class="k">namespace</span> <span class="n">TREE</span><span class="p">{</span>
<span class="linenos" data-linenos="17 "></span>    <span class="k">struct</span> <span class="nc">node</span><span class="p">{</span>
<span class="linenos" data-linenos="18 "></span>        <span class="kt">int</span> <span class="n">l</span><span class="p">,</span><span class="n">r</span><span class="p">;</span>
<span class="linenos" data-linenos="19 "></span>        <span class="kt">int</span> <span class="n">val</span><span class="p">;</span>
<span class="linenos" data-linenos="20 "></span>    <span class="p">}</span><span class="n">tree</span><span class="p">[</span><span class="n">maxn</span><span class="o">&lt;&lt;</span><span class="mi">3</span><span class="p">];</span>
<span class="linenos" data-linenos="21 "></span>    <span class="kt">void</span> <span class="nf">build</span><span class="p">(</span><span class="kt">int</span> <span class="n">x</span><span class="p">,</span><span class="kt">int</span> <span class="n">l</span><span class="p">,</span><span class="kt">int</span> <span class="n">r</span><span class="p">){</span>
<span class="linenos" data-linenos="22 "></span>        <span class="n">tree</span><span class="p">[</span><span class="n">x</span><span class="p">].</span><span class="n">l</span><span class="o">=</span><span class="n">l</span><span class="p">,</span><span class="n">tree</span><span class="p">[</span><span class="n">x</span><span class="p">].</span><span class="n">r</span><span class="o">=</span><span class="n">r</span><span class="p">,</span><span class="n">tree</span><span class="p">[</span><span class="n">x</span><span class="p">].</span><span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span>
<span class="linenos" data-linenos="23 "></span>        <span class="k">if</span><span class="p">(</span><span class="n">l</span><span class="o">==</span><span class="n">r</span><span class="p">)</span><span class="k">return</span><span class="p">;</span>
<span class="linenos" data-linenos="24 "></span>        <span class="kt">int</span> <span class="n">mid</span><span class="o">=</span><span class="n">l</span><span class="o">+</span><span class="n">r</span><span class="o">&gt;&gt;</span><span class="mi">1</span><span class="p">;</span>
<span class="linenos" data-linenos="25 "></span>        <span class="n">build</span><span class="p">(</span><span class="n">x</span><span class="o">&lt;&lt;</span><span class="mi">1</span><span class="p">,</span><span class="n">l</span><span class="p">,</span><span class="n">mid</span><span class="p">);</span>
<span class="linenos" data-linenos="26 "></span>        <span class="n">build</span><span class="p">(</span><span class="n">x</span><span class="o">&lt;&lt;</span><span class="mi">1</span><span class="o">|</span><span class="mi">1</span><span class="p">,</span><span class="n">mid</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span><span class="n">r</span><span class="p">);</span>
<span class="linenos" data-linenos="27 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos="28 "></span>    <span class="kt">void</span> <span class="nf">change</span><span class="p">(</span><span class="kt">int</span> <span class="n">x</span><span class="p">,</span><span class="kt">int</span> <span class="n">pos</span><span class="p">,</span><span class="kt">int</span> <span class="n">val</span><span class="p">){</span>
<span class="linenos" data-linenos="29 "></span>        <span class="n">tree</span><span class="p">[</span><span class="n">x</span><span class="p">].</span><span class="n">val</span><span class="o">=</span><span class="n">max</span><span class="p">(</span><span class="n">tree</span><span class="p">[</span><span class="n">x</span><span class="p">].</span><span class="n">val</span><span class="p">,</span><span class="n">val</span><span class="p">);</span>
<span class="linenos" data-linenos="30 "></span>        <span class="k">if</span><span class="p">(</span><span class="n">tree</span><span class="p">[</span><span class="n">x</span><span class="p">].</span><span class="n">l</span><span class="o">==</span><span class="n">tree</span><span class="p">[</span><span class="n">x</span><span class="p">].</span><span class="n">r</span><span class="p">)</span>
<span class="linenos" data-linenos="31 "></span>            <span class="k">return</span><span class="p">;</span>
<span class="linenos" data-linenos="32 "></span>        <span class="kt">int</span> <span class="n">mid</span><span class="o">=</span><span class="n">tree</span><span class="p">[</span><span class="n">x</span><span class="p">].</span><span class="n">l</span><span class="o">+</span><span class="n">tree</span><span class="p">[</span><span class="n">x</span><span class="p">].</span><span class="n">r</span><span class="o">&gt;&gt;</span><span class="mi">1</span><span class="p">;</span>
<span class="linenos" data-linenos="33 "></span>        <span class="k">if</span><span class="p">(</span><span class="n">pos</span><span class="o">&lt;=</span><span class="n">mid</span><span class="p">)</span><span class="n">change</span><span class="p">(</span><span class="n">x</span><span class="o">&lt;&lt;</span><span class="mi">1</span><span class="p">,</span><span class="n">pos</span><span class="p">,</span><span class="n">val</span><span class="p">);</span>
<span class="linenos" data-linenos="34 "></span>        <span class="k">else</span> <span class="n">change</span><span class="p">(</span><span class="n">x</span><span class="o">&lt;&lt;</span><span class="mi">1</span><span class="o">|</span><span class="mi">1</span><span class="p">,</span><span class="n">pos</span><span class="p">,</span><span class="n">val</span><span class="p">);</span>
<span class="linenos" data-linenos="35 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos="36 "></span>    <span class="kt">int</span> <span class="nf">query</span><span class="p">(</span><span class="kt">int</span> <span class="n">x</span><span class="p">,</span><span class="kt">int</span> <span class="n">l</span><span class="p">,</span><span class="kt">int</span> <span class="n">r</span><span class="p">){</span>
<span class="linenos" data-linenos="37 "></span>        <span class="k">if</span><span class="p">(</span><span class="n">l</span><span class="o">&lt;=</span><span class="n">tree</span><span class="p">[</span><span class="n">x</span><span class="p">].</span><span class="n">l</span><span class="o">&amp;&amp;</span><span class="n">tree</span><span class="p">[</span><span class="n">x</span><span class="p">].</span><span class="n">r</span><span class="o">&lt;=</span><span class="n">r</span><span class="p">)</span><span class="k">return</span> <span class="n">tree</span><span class="p">[</span><span class="n">x</span><span class="p">].</span><span class="n">val</span><span class="p">;</span>
<span class="linenos" data-linenos="38 "></span>        <span class="k">if</span><span class="p">(</span><span class="n">l</span><span class="o">&gt;</span><span class="n">tree</span><span class="p">[</span><span class="n">x</span><span class="p">].</span><span class="n">r</span><span class="o">||</span><span class="n">r</span><span class="o">&lt;</span><span class="n">tree</span><span class="p">[</span><span class="n">x</span><span class="p">].</span><span class="n">l</span><span class="p">)</span><span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
<span class="linenos" data-linenos="39 "></span>        <span class="k">return</span> <span class="n">max</span><span class="p">(</span><span class="n">query</span><span class="p">(</span><span class="n">x</span><span class="o">&lt;&lt;</span><span class="mi">1</span><span class="p">,</span><span class="n">l</span><span class="p">,</span><span class="n">r</span><span class="p">),</span><span class="n">query</span><span class="p">(</span><span class="n">x</span><span class="o">&lt;&lt;</span><span class="mi">1</span><span class="o">|</span><span class="mi">1</span><span class="p">,</span><span class="n">l</span><span class="p">,</span><span class="n">r</span><span class="p">));</span>
<span class="linenos" data-linenos="40 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos="41 "></span><span class="p">}</span>
<span class="linenos" data-linenos="42 "></span><span class="k">using</span> <span class="k">namespace</span> <span class="n">TREE</span><span class="p">;</span>
<span class="linenos" data-linenos="43 "></span><span class="kt">int</span> <span class="n">n</span><span class="p">,</span><span class="n">m</span><span class="p">;</span>
<span class="linenos" data-linenos="44 "></span><span class="kt">int</span> <span class="n">a</span><span class="p">[</span><span class="n">maxn</span><span class="p">];</span>
<span class="linenos" data-linenos="45 "></span><span class="k">struct</span> <span class="nc">nnn</span><span class="p">{</span>
<span class="linenos" data-linenos="46 "></span>    <span class="kt">int</span>  <span class="n">a</span><span class="p">,</span><span class="n">b</span><span class="p">;</span>
<span class="linenos" data-linenos="47 "></span>    <span class="kt">int</span> <span class="n">ans</span><span class="p">;</span>
<span class="linenos" data-linenos="48 "></span><span class="p">}</span><span class="n">cmd</span><span class="p">[</span><span class="n">maxn</span><span class="p">];</span>
<span class="linenos" data-linenos="49 "></span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="n">v</span><span class="p">[</span><span class="n">maxn</span><span class="p">];</span>
<span class="linenos" data-linenos="50 "></span><span class="n">set</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="n">S</span><span class="p">;</span><span class="n">map</span><span class="o">&lt;</span><span class="kt">int</span><span class="p">,</span><span class="kt">int</span><span class="o">&gt;</span><span class="n">M</span><span class="p">;</span>
<span class="linenos" data-linenos="51 "></span><span class="kt">int</span> <span class="n">tot</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="kt">int</span> <span class="n">pos</span><span class="p">[</span><span class="n">maxn</span><span class="p">];</span>
<span class="linenos" data-linenos="52 "></span><span class="kt">int</span> <span class="n">f</span><span class="p">[</span><span class="n">maxn</span><span class="p">],</span><span class="n">g</span><span class="p">[</span><span class="n">maxn</span><span class="p">];</span>
<span class="linenos" data-linenos="53 "></span><span class="kt">signed</span> <span class="nf">main</span><span class="p">(){</span>
<span class="linenos" data-linenos="54 "></span>    <span class="n">n</span><span class="o">=</span><span class="n">read</span><span class="p">();</span><span class="n">m</span><span class="o">=</span><span class="n">read</span><span class="p">();</span>
<span class="linenos" data-linenos="55 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;=</span><span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span>
<span class="linenos" data-linenos="56 "></span>        <span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=</span><span class="n">read</span><span class="p">(),</span><span class="n">S</span><span class="p">.</span><span class="n">insert</span><span class="p">(</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
<span class="linenos" data-linenos="57 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;=</span><span class="n">m</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span>
<span class="linenos" data-linenos="58 "></span>        <span class="n">cmd</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">a</span><span class="o">=</span><span class="n">read</span><span class="p">(),</span><span class="n">cmd</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">b</span><span class="o">=</span><span class="n">read</span><span class="p">(),</span><span class="n">S</span><span class="p">.</span><span class="n">insert</span><span class="p">(</span><span class="n">cmd</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">b</span><span class="p">),</span><span class="n">v</span><span class="p">[</span><span class="n">cmd</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">a</span><span class="p">].</span><span class="n">push_back</span><span class="p">(</span><span class="n">i</span><span class="p">);</span>
<span class="linenos" data-linenos="59 "></span>    <span class="k">for</span><span class="p">(</span><span class="n">set</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;::</span><span class="n">iterator</span> <span class="n">it</span><span class="o">=</span><span class="n">S</span><span class="p">.</span><span class="n">begin</span><span class="p">();</span><span class="n">it</span><span class="o">!=</span><span class="n">S</span><span class="p">.</span><span class="n">end</span><span class="p">();</span><span class="n">it</span><span class="o">++</span><span class="p">)</span>
<span class="linenos" data-linenos="60 "></span>        <span class="n">M</span><span class="p">[</span><span class="o">*</span><span class="n">it</span><span class="p">]</span><span class="o">=++</span><span class="n">tot</span><span class="p">;</span>
<span class="linenos" data-linenos="61 "></span>    <span class="n">build</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="n">tot</span><span class="p">);</span>
<span class="linenos" data-linenos="62 "></span>    <span class="kt">int</span> <span class="n">len</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span>
<span class="linenos" data-linenos="63 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;=</span><span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">){</span>
<span class="linenos" data-linenos="64 "></span>        <span class="n">f</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=</span><span class="n">query</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="n">M</span><span class="p">[</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]]</span><span class="mi">-1</span><span class="p">)</span><span class="o">+</span><span class="mi">1</span><span class="p">;</span>
<span class="linenos" data-linenos="65 "></span>        <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">j</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">j</span><span class="o">&lt;</span><span class="n">v</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">size</span><span class="p">();</span><span class="n">j</span><span class="o">++</span><span class="p">)</span>
<span class="linenos" data-linenos="66 "></span>            <span class="n">cmd</span><span class="p">[</span><span class="n">v</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="n">j</span><span class="p">]].</span><span class="n">ans</span><span class="o">+=</span><span class="n">query</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="n">M</span><span class="p">[</span><span class="n">cmd</span><span class="p">[</span><span class="n">v</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="n">j</span><span class="p">]].</span><span class="n">b</span><span class="p">]</span><span class="mi">-1</span><span class="p">);</span>
<span class="linenos" data-linenos="67 "></span>        <span class="n">change</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="n">M</span><span class="p">[</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]],</span><span class="n">f</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
<span class="linenos" data-linenos="68 "></span>        <span class="n">len</span><span class="o">=</span><span class="n">max</span><span class="p">(</span><span class="n">len</span><span class="p">,</span><span class="n">f</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
<span class="linenos" data-linenos="69 "></span>        <span class="c1">//write(f[i]),putchar(&#39;\n&#39;);</span>
<span class="linenos" data-linenos="70 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos="71 "></span>    <span class="n">build</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="n">tot</span><span class="p">);</span>
<span class="linenos" data-linenos="72 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">&gt;=</span><span class="mi">1</span><span class="p">;</span><span class="n">i</span><span class="o">--</span><span class="p">){</span>
<span class="linenos" data-linenos="73 "></span>        <span class="n">g</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=</span><span class="n">query</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="n">M</span><span class="p">[</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]]</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span><span class="n">tot</span><span class="p">)</span><span class="o">+</span><span class="mi">1</span><span class="p">;</span>
<span class="linenos" data-linenos="74 "></span>        <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">j</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">j</span><span class="o">&lt;</span><span class="n">v</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">size</span><span class="p">();</span><span class="n">j</span><span class="o">++</span><span class="p">)</span>
<span class="linenos" data-linenos="75 "></span>            <span class="n">cmd</span><span class="p">[</span><span class="n">v</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="n">j</span><span class="p">]].</span><span class="n">ans</span><span class="o">+=</span><span class="n">query</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="n">M</span><span class="p">[</span><span class="n">cmd</span><span class="p">[</span><span class="n">v</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="n">j</span><span class="p">]].</span><span class="n">b</span><span class="p">]</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span><span class="n">tot</span><span class="p">);</span>
<span class="linenos" data-linenos="76 "></span>        <span class="n">change</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="n">M</span><span class="p">[</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]],</span><span class="n">g</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
<span class="linenos" data-linenos="77 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos="78 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;=</span><span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span>
<span class="linenos" data-linenos="79 "></span>        <span class="k">if</span><span class="p">(</span><span class="n">f</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">+</span><span class="n">g</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">==</span><span class="n">len</span><span class="o">+</span><span class="mi">1</span><span class="p">)</span>
<span class="linenos" data-linenos="80 "></span>            <span class="n">pos</span><span class="p">[</span><span class="n">f</span><span class="p">[</span><span class="n">i</span><span class="p">]]</span><span class="o">++</span><span class="p">;</span>
<span class="linenos" data-linenos="81 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;=</span><span class="n">m</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">){</span>
<span class="linenos" data-linenos="82 "></span>        <span class="kt">int</span> <span class="n">A</span><span class="o">=</span><span class="n">cmd</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">a</span><span class="p">,</span><span class="n">B</span><span class="o">=</span><span class="n">cmd</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">b</span><span class="p">,</span><span class="n">C</span><span class="o">=</span><span class="n">cmd</span><span class="p">[</span><span class="n">i</span><span class="p">].</span><span class="n">ans</span><span class="p">;</span>
<span class="linenos" data-linenos="83 "></span>        <span class="k">if</span><span class="p">(</span><span class="n">f</span><span class="p">[</span><span class="n">A</span><span class="p">]</span><span class="o">+</span><span class="n">g</span><span class="p">[</span><span class="n">A</span><span class="p">]</span><span class="o">==</span><span class="n">len</span><span class="o">+</span><span class="mi">1</span><span class="o">&amp;&amp;</span><span class="n">pos</span><span class="p">[</span><span class="n">f</span><span class="p">[</span><span class="n">A</span><span class="p">]]</span><span class="o">==</span><span class="mi">1</span><span class="p">)</span>
<span class="linenos" data-linenos="84 "></span>            <span class="n">write</span><span class="p">(</span><span class="n">max</span><span class="p">(</span><span class="n">len</span><span class="mi">-1</span><span class="p">,</span><span class="n">C</span><span class="o">+</span><span class="mi">1</span><span class="p">)),</span><span class="n">putchar</span><span class="p">(</span><span class="sc">&#39;\n&#39;</span><span class="p">);</span>
<span class="linenos" data-linenos="85 "></span>        <span class="k">else</span>
<span class="linenos" data-linenos="86 "></span>            <span class="n">write</span><span class="p">(</span><span class="n">max</span><span class="p">(</span><span class="n">len</span><span class="p">,</span><span class="n">C</span><span class="o">+</span><span class="mi">1</span><span class="p">)),</span><span class="n">putchar</span><span class="p">(</span><span class="sc">&#39;\n&#39;</span><span class="p">);</span>
<span class="linenos" data-linenos="87 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos="88 "></span><span class="p">}</span>
</code></pre></div></p>
			</div>
			<div class="panel panel-default card" style="padding: 10px;height: 50px;font-size: 20px;">
				<a style="float: left;" href="\article\CF698C.html"><i class="fa fa-angle-double-left"></i></a>
			</div>
			<div class="panel panel-default card" style="padding: 10px;font-size: 20px;" id="vcomments">
				
			</div>
			<script>
				new Valine({
					el: '#vcomments',
					appId: 'PAlFUPg0pQVTFTEo8gCB4BCf-gzGzoHsz',
					appKey: 'U38ejnLUiizJ6vLyp6ql4hRq',
					path: window.location.pathname
				})
			</script>
		</div>
		<div class="col-md-3">
				<div class="panel panel-default card">
				<div class="panel-heading">
					<h3 class="panel-title">
						<i class="fa fa-info"></i>&emsp;
						<strong>文章信息</strong>
					</h3>
				</div>
                <div style="margin: 10px;">
                    <div style="margin-top: 8px;display: flex;"> 
    <span style="flex: 1 0 auto;margin-right: 6px;">标题</span>
    <span><font style="font-weight: bold">题解 CF650D 【Zip-line】</font></span>
	</div><div style="margin-top: 8px;display: flex;"> 
    <span style="flex: 1 0 auto;margin-right: 6px;">日期</span>
    <span>2020-06-04 22:04:00</span>
	</div>
                </div>
				</div>
				<div class="panel panel-default card">
				<div class="panel-heading">
					<h3 class="panel-title">
						<i class="fa fa-tag"></i>&emsp;
						<strong>标签</strong>
					</h3>
				</div>
				<div style="margin: 10px;">
					<a href="/tags/2020/" class="tag"><span  style="background-color: rgb(52, 152, 219);">2020</span></a>&nbsp;<a href="/tags/树状数组/" class="tag"><span  style="background-color: rgb(231, 76, 60);">树状数组</span></a>&nbsp;<a href="/tags/题解/" class="tag"><span  style="background-color: rgb(82, 196, 26);">题解</span></a>
				</div>
				</div>
				
			<div class="panel panel-default card">
					<div class="panel-heading">
						<h3 class="panel-title">
							<i class="fa fa-user-circle-o"></i>&emsp;
							<strong>caijicjl</strong>
						</h3>
					</div>
					<div style="width: 60%;display: inline-block;padding-top: 10px;">
						<ul class="propertyLinks" style="list-style-type: none;">
							<li>
								<img style="vertical-align:middle;position:relative;top:-2px" src="/img/rating-16x16.png">
								Rating:&nbsp;
								<span style="font-weight:bold;color: gray ">312</span>
							</li>
							<li>
								<img style="vertical-align:middle;position:relative;top:-2px" src="/img/star_blue_16.png">
								Contribution:&nbsp;
								<span style="color:gray;font-weight:bold;">0</span>
							</li>
						</ul>
						<ul class="nav-links">
							<li><a href="/settings/">Settings</a></li>
							<li><a href="/archives/">Blog</a></li>
							<li><a href="/teams">Teams</a></li>
							<li><a href="/submissions/dingdingsb">Submissions</a></li>
							<li><a href="/usertalk">Talks</a></li>
							<li><a href="/contests/with/dingdingsb">Contests</a></li>
						</ul>
					</div>
					<div style="display:inline-block;vertical-align: top;margin: 10px;text-align: center;">
						<div style="height:50px;width:50px"><img src="/img/avatar.png"/></div>
						<div><a href="https://www.luogu.com.cn/user/174304" style="font-weight:bold;color:gray">caijicjl</a></div>
					</div>
				</div>
		<div class="panel panel-default card">
				<div class="panel-heading">
					<h3 class="panel-title">
						<i class="fa fa-external-link"></i>&emsp;
						<strong>画中画</strong>
					</h3>
				</div>
				<div style="width:100%;margin:10px">
				<input type="text" id="url"/>
				<input value="创建" type="button" onclick="creat('kk')" /> 
				</div>
		</div>
		<script src="/js/hitokoto.js"></script>
							

				
				<span id="kk"></span>
				<div  id="myScrollspy" class="card" style="width: 100%;"  data-spy="affix">
					<script src="/js/make_toc.js"></script>
				</div>
		</div>
	</div>
 </div>
</body>
</html>
